Majority Logic: Axiomatization and Completeness
نویسندگان
چکیده
Graded modal logic, as presented in [5], extends propositional modal systems with a set of modal operators ♦n (n ∈ N) that express “there are more than n accessible worlds such that...”. We extend∗ GML with a modal operator W that can express “there are more than or equal to half of the accessible worlds such that...”. The semantics of W is straightforward provided there are only finitely many accessible worlds; however if there are infinitely many accessible worlds the situation becomes much more complex. In order to deal with such situations, we introduce a majority space. A majority space is a set W together with a collection of subsets of W intended to be the weak majority (more than or equal to half) subsets of W . We then extend a standard Kripke structure with a function that assigns a majority space over the set of accessible states to each state. Given this extended Kripke semantics, majority logic is proved sound and complete.
منابع مشابه
Majority Logic
We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness proofs. Along the way, we must answer the question what is a majority of an infinite set? Majority spaces are introduced as a solution to this question.
متن کاملSome problems with two axiomatizations of discussive logic
Problems in two axiomatizations of Jaśkowski’s discussive (or discursive) logic D2 are considered. A recent axiomatization of D2 and completeness proof relative to D2’s intended semantics seems to be mistaken because some formulas valid according to the intended semantics turn out to be unprovable. Although no new axiomatization is offered, nor a repaired completeness proof given, the shortcomi...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملConstructive Completeness for Modal Logic with Transitive Closure
Classical modal logic with transitive closure appears as a subsystem of logics used for program verification. The logic can be axiomatized with a Hilbert system. In this paper we develop a constructive completeness proof for the axiomatization using Coq with Ssreflect. The proof is based on a novel analytic Gentzen system, which yields a certifying decision procedure that for a formula construc...
متن کاملSubset Space Logic with Arbitrary Announcements
In this paper we introduce public announcements to Subset Space Logic (SSL). In order to do this we have to change the original semantics for SSL a little and consider a weaker version of SSL without the cross axiom. We present an axiomatization, prove completeness and show that this logic is PSPACE-complete. Finally, we add the arbitrary announcement modality which expresses “true after any an...
متن کاملAxiomatization of Fuzzy Attribute Logic over Complete Residuated Lattices
The paper deals with fuzzy attribute logic (FAL) and shows its completeness over all complete residuated lattices. FAL is a calculus for reasoning with if-then rules describing particular attribute dependencies in objectattribute data. Completeness is proved in two versions: classical-style completeness and graded-style completeness.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006